package com.bigshen.algorithm.kDFS;

public class A {

    public static void main(String[] args) {

        int[] array = {1,2,1,2,1};

        int[] clone = array;

        clone[0] = 0;

        System.out.println(array);

        int[][] nums = new int[5][5];

        int[] a1 = {1,2,3,4,5};
        int[] a2 = {1,2,3,4,5};
        int[] a3 = {1,2,3,4,5};
        int[] a4 = {1,2,3,4,5};
        int[] a5 = {1,2,3,4,5};

        nums[0] = a1;
        nums[1] = a2;
        nums[2] = a3;
        nums[3] = a4;
        nums[4] = a5;

        for (int i = 0; i < nums.length; i ++) {
            System.out.println();
            for (int j = 0; j < nums.length; j ++) {

                System.out.print(j + "|" + i + "  ");

            }

        }

    }

}
